A Hybrid Approach for Optimization of Capacitated Centered Clustering Problem
نویسنده
چکیده
Capacitated Centered Clustering problem (CPMP) is an important variation of p-median problems. The p-median problems are known to be NP-hard. A hybrid genetic algorithm is used to solve the problem efficiently. The analysis shows that the performance of the proposed algorithm is better than the traditional local search heuristic.
منابع مشابه
Tabu-KM: A Hybrid Clustering Algorithm Based on Tabu Search Approach
The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the ...
متن کاملAn Efficient Hybrid Metaheuristic for Capacitated p-Median Problem
Capacitated p-median problem (CPMP) is a well-known facility-location problem, in which p capacitated facility points are selected to satisfy n demand points in such a way that the total assigned demand to each facility does not exceed its capacity. Minimizing the total sum of distances between each demand point and its nearest facility point is the objective of the problem. Developing an effic...
متن کاملA fuzzy capacitated facility location-network design model: A hybrid firefly and invasive weed optimization (FIWO) solution
Facility location-network design (FLND) problem, which determines the location of facilities and also communication links between the demand and facility nodes, is arisen from the combination of the facility location and network design problems. This paper deals with fuzzy capacitated facility location-network design model which aims to select the facilities and candidate links in a way that yi...
متن کاملGROUND MOTION CLUSTERING BY A HYBRID K-MEANS AND COLLIDING BODIES OPTIMIZATION
Stochastic nature of earthquake has raised a challenge for engineers to choose which record for their analyses. Clustering is offered as a solution for such a data mining problem to automatically distinguish between ground motion records based on similarities in the corresponding seismic attributes. The present work formulates an optimization problem to seek for the best clustering measures. In...
متن کاملA hybrid DEA-based K-means and invasive weed optimization for facility location problem
In this paper, instead of the classical approach to the multi-criteria location selection problem, a new approach was presented based on selecting a portfolio of locations. First, the indices affecting the selection of maintenance stations were collected. The K-means model was used for clustering the maintenance stations. The optimal number of clusters was calculated through the Silhou...
متن کامل